The ergodic decomposition of asymptotically mean stationary random sources

نویسنده

  • Alexander Schönhuth
چکیده

It is demonstrated how to represent asymptotically mean stationary (AMS) random sources with values in standard spaces as mixtures of ergodic AMS sources. This an extension of the well known decomposition of stationary sources which has facilitated the generalization of prominent source coding theorems to arbitrary, not necessarily ergodic, stationary sources. Asymptotic mean stationarity generalizes the definition of stationarity and covers a much larger variety of real-world examples of random sources of practical interest. It is sketched how to obtain source coding and related theorems for arbitrary, not necessarily ergodic, AMS sources, based on the presented ergodic decomposition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hammersley’s Process with Sources and Sinks by Eric Cator

We show that, for a stationary version of Hammersley’s process, with Poisson “sources” on the positive x-axis, and Poisson “sinks” on the positive y-axis, an isolated second-class particle, located at the origin at time zero, moves asymptotically, with probability 1, along the characteristic of a conservation equation for Hammersley’s process. This allows us to show that Hammersley’s process wi...

متن کامل

Hammersley’s process with sources and sinks

We show that, for a stationary version of Hammersley’s process, with Poisson “sources” on the positive x-axis, and Poisson “sinks” on the positive y-axis, an isolated second class particle, located at the origin at time zero, moves asymptotically, with probability one, along the characteristic of a conservation equation for Hammersley’s process. This allows us to show that Hammersley’s process ...

متن کامل

Source Codes as Random Number Generators

A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asymptotically fair coin flips from a stationary ergodic source at a rate of bits per source symbol equal to the entropy rate of the source. Since optimal noiseless data compression codes produce incompressible outputs, it i...

متن کامل

Optimal encoding of non-stationary sources

The usual assumption for proofs of the optimality of lossless encoding is a stationary ergodic source. Dynamic sources with non-stationary probability distributions occur in many practical situations where the data source is formed from a composition of distinct sources, for example, a document with multiple authors, a multimedia document, or the composition of distinct packets sent over a comm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0804.2487  شماره 

صفحات  -

تاریخ انتشار 2008